Complexity of a Single Face in an Arrangement of s-Intersecting Curves
نویسندگان
چکیده
Consider a face F in an arrangement of n Jordan curves in the plane, no two of which intersect more than s times. We prove that the combinatorial complexity of F is O(λs(n)), O(λs+1(n)), and O(λs+2(n)), when the curves are bi-infinite, semi-infinite, or bounded, respectively; λk(n) is the maximum length of a Davenport-Schinzel sequence of order k on an alphabet of n symbols. Our bounds asymptotically match the known worst-case lower bounds. Our proof settles the still apparently open case of semi-infinite curves. Moreover, it treats the three cases in a fairly uniform fashion.
منابع مشابه
Impact of Dynamic Assessment on the Writing Performance of English as Foreign Language Learners in Asynchronous Web 2.0 and Face-to-face Environments
This study sought to investigate dynamic assessment (DA) - an assessment approach that embeds inter- vention within the assessment process and that yields information about the learner’s responsiveness to this intervention - and the writing performance of the second language (L2) learners in Web 2.0 contexts. To this end, pre and post-treatment writings of 45 par...
متن کاملLinear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common Point
The Bentley Ottmann sweep line algorithm is a standard tool to compute the arrangement of algebraic curves in the plane. If degenerate positions are not excluded from the input, variants of this algorithm must, among other things, handle k ≥ 2 curves intersecting simultaneously in a single intersection point. In that situation, the algorithm knows the order of the curves immediately left of the...
متن کاملLocal Scour at Single Column Arrangement of Bridge Piles Group
In regard to wide piers, the pile group rather than single pile is used frequently to bear the loading of the structure in a particular arrangement; piles group composed of only one column of piles in the flow direction has a great effect on supporting the bridge deck. In this study, local scour at a single column arrangement of the piles group made up of four rows of piles characterized by dif...
متن کاملArrangements of Pseudocircles: On Circularizability
An arrangement of pseudocircles is a collection of simple closed curves on the sphere or in the plane such that every pair is either disjoint or intersects in exactly two crossing points. We call an arrangement intersecting if every pair of pseudocircles intersects twice. An arrangement is circularizable if there is a combinatorially equivalent arrangement of circles. Kang and Müller showed tha...
متن کاملArrangements of Segments that Share Endpoints : Single
We provide new combinatorial bounds on the complexity of a face in an arrangement of segments in the plane. In particular, we show that the complexity of a single face in an arrangement of n line segments determined by h endpoints is O(h logh). While the previous upper bound, O(nn(n)), is tight for segments with distinct endpoints, it is far from being optimal when n = (h 2). Our result shows t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1108.4336 شماره
صفحات -
تاریخ انتشار 2011